A nonstationary iterative process for nonexpansive mappings

Iterative Algorithms for Nonexpansive Mappings

for all x, y ∈ C. We use F T to denote the set of fixed points of T , that is, F T {x ∈ C : Tx x}. Throughout the paper, we assume that F T / ∅. Construction of fixed points of nonlinear mappings is an important and active research area. In particular, iterative methods for finding fixed points of nonexpansive mappings have received a vast investigation; see 1–28 . It is well known that the Pic...

Weak Convergence of Mann Iterative Algorithm for two Nonexpansive mappings

The mann fixed point algorithm play an importmant role in the approximation of fixed points of nonexpansive operators. In this paper, by considering new conditions, we prove the weak convergence of mann fixed point algorithm, for finding a common fixed point of two nonexpansive mappings in real Hilbert spaces. This results extend the privious results given by Kanzow and Shehu. Finally, we give ...

Modified Iterative Algorithms for Nonexpansive Mappings

Let H be a real Hilbert space, let S, T be two nonexpansive mappings such that F S ∩ F T / ∅, let f be a contractive mapping, and let A be a strongly positive linear bounded operator on H. In this paper, we suggest and consider the strong converegence analysis of a new two-step iterative algorithms for finding the approximate solution of two nonexpansive mappings as xn 1 βnxn 1 − βn Syn, yn αnγ...

A New Composite Implicit Iterative Process for a Finite Family of Nonexpansive Mappings in Banach Spaces

A General Iterative Algorithm for Nonexpansive Mappings in Banach Spaces

Let E be a real q-uniformly smooth Banach space whose duality map is weakly sequentially continuous. Let T : E → E be a nonexpansive mapping with F (T ) 6= ∅. Let A : E → E be an η-strongly accretive map which is also κ-Lipschitzian. Let f : E → E be a contraction map with coefficient 0 < α < 1. Let a sequence {yn} be defined iteratively by y0 ∈ E, yn+1 = αnγf(yn) + (I − αnμA)Tyn, n ≥ 0, where ...